15 research outputs found
Characterising vertex-star transitive and edge-star transitive graphs
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k, L)-complex. The two conditions are symmetry properties of the graph, namely vertex-star transitivity and edge-star transitivity. In this paper we investigate vertex- and edge-star transitive graphs by studying the structure of the vertex and edge stabilisers of such graphs. We also provide new examples of graphs that are both vertex-star transitive and edge-star transitive
Computing tensor decompositions of finite matrix groups
special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and ComplexityWe describe an algorithm to compute tensor decompositions of central products of groups. The novelty over previous algorithms is that in the case of matrix groups that are both tensor decomposable and imprimitive, the new algorithm more often outputs the more desirable tensor decomposition